منابع مشابه
On computing the $2$-vertex-connected components of directed graphs
In this paper we consider the problem of computing the 2-vertex-connected components (2-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs in O(mn) time, the second in O(nm) time. Furthermore, we show that the old algorithm of Erusalimskii and Svetlov runs inO(nm) time. In this paper, we investigate the relationship between 2-vccs and domi...
متن کاملDiameters of Connected Components of Commuting Graphs
In this paper, we calculate diameters of connected components of commuting graphs of GLn(S), for an integer n ≥ 2 and a commutative antinegative entire semiring S, unless n is a non-prime odd number and S has at least two invertible elements.
متن کاملCommon connected components of interval graphs
The Common Connected Problem (CCP) consists in identifying common connected components in two or more graphs on the same vertices (or reduced to). More formally, let G1(V,E1) and G2(V,E2) be two such graphs and let V ′ ⊂ V . If G1[V ] and G2[V ] are both connected, V ′ is said a common connected component. The CCP problem is the identification of maximal (for the inclusion order) such component...
متن کاملOn Computing Connected Components of Line Segments
It is shown that given a set of n line segments their connected components can be computed in time O n log n A bound of o n for this problem would imply a similar bound for detecting for a given set of n points and n lines whether some point lies on some of the lines This problem known as Hopcroft s problem is believed to have a lower bound of n For the special case when the endpoints of each s...
متن کاملDecomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960’s, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte’s decomposition to include all infinite 2-connected graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematical Research
سال: 2014
ISSN: 2227-4324
DOI: 10.14419/ijamr.v3i4.3189